Connected component and simple polygon intersection searching
نویسندگان
چکیده
منابع مشابه
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
We present an efficient dynamic data structure that supports geodesic nearest neighbor queries for a set of point sites S in a static simple polygon P . Our data structure allows us to insert a new site in S, delete a site from S, and ask for the site in S closest to an arbitrary query point q ∈ P . All distances are measured using the geodesic distance, that is, the length of the shortest path...
متن کاملImproved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
We present an efficient dynamic data structure that supports geodesic nearest neighbor queries for a set S of point sites in a static simple polygon P . Our data structure allows us to insert a new site in S, delete a site from S, and ask for the site in S closest to an arbitrary query point q ∈ P . All distances are measured using the geodesic distance, that is, the length of the shortest path...
متن کاملConvex Polygon Intersection Graphs
Geometric intersection graphs are graphs determined by the intersections of certain geometric objects. We study the complexity of visualizing an arrangement of objects that induces a given intersection graph. We give a general framework for describing classes of geometric intersection graphs, using arbitrary finite base sets of rationally given convex polygons and rationally-constrained affine ...
متن کاملGuaranteed intersection-free polygon morphing
We present a method for naturally and continuously morphing two simple planar polygons with corresponding vertices in a manner that guarantees that the intermediate polygons are also simple. This contrasts with all existing polygon morphing schemes who cannot guarantee the non-self-intersection property on a global scale, due to the heuristics they employ. Our method achieves this property by r...
متن کاملConnected Treewidth and Connected Graph Searching
Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible. Goal In a contaminated network, an invisible omniscient arbitrary fast fugitive ; a team of searchers ; We want to find a strategy that catch the fugitive using the fewest searchers as possible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1996
ISSN: 0178-4617,1432-0541
DOI: 10.1007/bf01940884